Simulated Annealing Decoder for Linear Block Codes

Simulated Annealing and Optimal Codes

Using simulated annealing to design good codes

A NNEAL, as defined in Webster’s New Collegiate Dictionary, means: 1) to heat (as glass) in order to fix laid-on colors, and 2) to heat and then cool (as steel or glass) usually for softening and making less brittle. The cooling stage of annealing is usually done slowly to reduce the number of defects in the crystal structure (as steel) and to minimize the potential energy stored in the molecul...

A Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric

A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the cost of the unexplored portion of the code tree. It is shown that for certain block codes the average computational complexity of this metric is superior to that of the Fano metric. A new function, the cumulative column di...

A new scalable decoder for linear space-time block codes with intersymbol interference

Space-Time Codes represent a key technology for future broadband wireless communication systems. In this paper a class of space-time block codes according to [1] is used which can lead to intersymbol interference (ISI) due to an optimized diversity performance. Therefore ISI compensation is an important task of the decoding process of these codes. Several known ISI compensation methods can be a...

A Novel Decoder Based on Parallel Genetic Algorithms for Linear Block Codes

Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance a...